Reliable Channels for Systems in the Presence of Byzantine Faults
نویسندگان
چکیده
منابع مشابه
Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults
We consider the following problem: two nodes want to reliably communicate in a dynamic multihop network where some nodes have been compromised, and may have a totally arbitrary and unpredictable behavior. These nodes are called Byzantine. We consider the two cases where cryptography is available and not available. We prove the necessary and sufficient condition (that is, the weakest possible co...
متن کاملDegradable Agreement in the Presence of Byzantine Faults
Consider a system consisting of a sender that wants to send a value to certain receivers. Byzantine agreement protocols [7, 6, 2] have been proposed to achieve this in the presence of arbitrary failures. The imposed requirement typically is that the fault-free receivers must all agree on the same value [7, 6]. (Dolev [2] analyzes a seemingly weaker form of agreement). It has been shown that suc...
متن کاملBounds on Topology Discovery in the Presence of Byzantine Faults
This report is a companion to another technical report [3] to present the formal proofs that could not fit into the conference proceedings of this article [4] due to space limitations. In this report we revisit the problem of Byzantine-robust topology discovery. We formally state the weak and strong versions of the problem. We focus on non-cryptographic solutions to these problems and explore t...
متن کاملSemi-Passive Replication in the Presence of Byzantine Faults
Semi-passive replication is a variant of passive replication that does not rely on a group membership service. Défago et al. [4] defined the semi-passive replication concept in the crash fault model and described a semi-passive replication algorithm based on a lazy consensus algorithm. In this paper, we consider semipassive replication and lazy consensus for a Byzantine fault model. We present ...
متن کاملFormally Verified Byzantine Agreement in Presence of Link Faults
This paper shows that deterministic consensus in synchronous distributed systems with link faults is possible, despite the impossibility result of (Gray, 1978). Instead of using randomization, we overcome this impossibility by moderately restricting the inconsistency that link faults may cause system-wide. Relying upon a novel hybrid fault model that provides different classes of faults for bot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2016
ISSN: 2261-236X
DOI: 10.1051/matecconf/20164207002